Infinite orbit depth and length of Melnikov functions
نویسندگان
چکیده
منابع مشابه
Logics of Infinite Depth
Consider a definition of depth of a logic as the supremum of ordinal types of wellordered descending chains. This extends the usual definition of codimension to infinite depths. Logics may either have no depth, or have countable depth in case a maximal well-ordered chain exists, or be of depth !1. We shall exhibit logics of all three types. We show in particular that many well-known systems, am...
متن کاملa contrastive study of rhetorical functions of citation in iranian and international elt scopus journals
writing an academic article requires the researchers to provide support for their works by learning how to cite the works of others. various studies regarding the analysis of citation in m.a theses have been done, while little work has been done on comparison of citations among elt scopus journal articles, and so the dearth of research in this area demands for further investigation into citatio...
Depth Two and Infinite Index
An algebra extension A | B is right depth two in this paper if its tensor-square is A-B-isomorphic to a direct summand of any (not necessarily finite) direct sum of A with itself. For example, normal subgroups of infinite groups, infinitely generated Hopf-Galois extensions and infinite dimensional algebras are depth two in this extended sense. The added generality loses some duality results obt...
متن کاملOn the Number of Zeros of Melnikov Functions
We provide an effective uniform upper bond for the number of zeros of the first non-vanishing Melnikov function of a polynomial perturbations of a planar polynomial Hamiltonian vector field. The bound depends on degrees of the field and of the perturbation, and on the order k of the Melnikov function. The generic case k = 1 was considered by Binyamini, Novikov and Yakovenko ( [BNY10]). The boun...
متن کاملDepth+ and Length+ of Boolean Algebras
Suppose κ = cf(κ), λ > cf(λ) = κ and λ = λ. We prove that there exist a sequence 〈Bi : i < κ〉 of Boolean algebras and an ultrafilterD on κ so that λ = ∏ i<κ Depth(Bi)/D < Depth ( ∏ i<κ Bi/D) = λ . An identical result holds also for Length. The proof is carried in ZFC, and it holds even above large cardinals. 2010 Mathematics Subject Classification. Primary: 06E05, 03G05. Secondary: 03E45.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré C, Analyse non linéaire
سال: 2019
ISSN: 0294-1449
DOI: 10.1016/j.anihpc.2019.07.003